Spatially-Structured Evolutionary Algorithms and Sharing: Do They Mix?
نویسندگان
چکیده
Spatially-structured populations are one approach to increasing genetic diversity in an evolutionary algorithm (EA). However, they are susceptible to convergence to a single peak in a multimodal fitness landscape. Niching methods, such as fitness sharing, allow an EA to maintain multiple solutions in a single population, however they have rarely been used in conjunction with spatially-structured populations. This paper introduces local sharing, a method that applies sharing to the overlapping demes of a spatially-structured population. The combination of these two methods succeeds in maintaining multiple solutions in problems that have previously proved difficult for sharing alone (and vice-versa).
منابع مشابه
Approximate Pareto Optimal Solutions of Multi objective Optimal Control Problems by Evolutionary Algorithms
In this paper an approach based on evolutionary algorithms to find Pareto optimal pair of state and control for multi-objective optimal control problems (MOOCP)'s is introduced. In this approach, first a discretized form of the time-control space is considered and then, a piecewise linear control and a piecewise linear trajectory are obtained from the discretized time-control space using ...
متن کاملAn Analysis of Local Selection Algorithms in a Spatially Structured Evolutionary Algorithm
A critical part of the design of eeective EAs is to obtain a proper balance between exploration and exploitation. A key element of this balance is the selection algorithm used. Although we have for some time now understood the relative diierences between various selection methods for standard centralized EAs, our understanding of decentralized EAs has been less complete. In this paper we presen...
متن کاملOptimization of sediment rating curve coefficients using evolutionary algorithms and unsupervised artificial neural network
Sediment rating curve (SRC) is a conventional and a common regression model in estimating suspended sediment load (SSL) of flow discharge. However, in most cases the data log-transformation in SRC models causing a bias which underestimates SSL prediction. In this study, using the daily stream flow and suspended sediment load data from Shalman hydrometric station on Shalmanroud River, Guilan Pro...
متن کاملA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملOn Takeover Times in Spatially Structured Populations: Array and Ring
The takeover time is the expected number of iterations of some selection method until a population consists entirely of copies of the best individual under the assumption that only one best individual is contained in the initial population. This quantity may be used to assess and compare the ‘selection pressures’ of selection methods used in evolutionary algorithms. Here, the notion is generali...
متن کامل